Cover-preserving embeddings of finite length semimodular lattices into simple semimodular lattices
نویسندگان
چکیده
منابع مشابه
Congruence-preserving Extensions of Finite Lattices to Semimodular Lattices
We prove that every finite lattice has a congruence-preserving extension to a finite semimodular lattice.
متن کاملCongruence Lattices of Finite Semimodular Lattices
We prove that every finite distributive lattice can be represented as the congruence lattice of a finite (planar) semimodular lattice.
متن کاملSemimodular Lattices and Semibuildings
In a ranked lattice, we consider two maximal chains, or “flags” to be i-adjacent if they are equal except possibly on rank i . Thus, a finite rank lattice is a chamber system. If the lattice is semimodular, as noted in [9], there is a “Jordan-Hölder permutation” between any two flags. This permutation has the properties of an Sn-distance function on the chamber system of flags. Using these noti...
متن کاملGraph Automorphisms of Semimodular Lattices
This paper deals with the relations between graph automorphisms and direct factors of a semimodular lattice of locally finite length.
متن کاملA Construction of Semimodular Lattices
In this paper we prove that if !.l' is a finite lattice. and r is an integral valued function on !.l' satisfying some very natural then there exists a finite geometric (that is.• semimodular and atomistic) lattice containing asa sublatticesuch that r !.l'restricted to Sf. Moreover. we show that if, for all intervals of. semimodular lattices of length at most r(e) are given. then can be chosen t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra universalis
سال: 2010
ISSN: 0002-5240,1420-8911
DOI: 10.1007/s00012-010-0091-2